Greedily Partitioning the Natural Numbers into Sets Free of Arithmetic Progressions
نویسندگان
چکیده
منابع مشابه
Greedily Partitioning the Natural Numbers into Sets Free of Arithmetic Progressions
We describe a "greedy" algorithm for partitioning the natural numbers into sets free of arithmetic progressions of length 3. A recursive formula governing the resulting partition is proved, and some features of its asymptotic behavior are discussed. Introduction. In 1927, van der Waerden [12] showed that if the set of nonnegative integers is partitioned into a finite number of sets, one of thes...
متن کاملIndependent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers
We show that if G is a Kr-free graph onN, there are independent sets in G which contain an arbitrarily long arithmetic progression together with its difference. This is a common generalization of theorems of Schur, van der Waerden, and Ramsey. We also discuss various related questions regarding (m, p, c)-sets and parameter words.
متن کاملPalindromic Numbers in Arithmetic Progressions
Integers have many interesting properties. In this paper it will be shown that, for an arbitrary nonconstant arithmetic progression {an}TM=l of positive integers (denoted by N), either {an}TM=l contains infinitely many palindromic numbers or else 10|aw for every n GN. (This result is a generalization of the theorem concerning the existence of palindromic multiples, cf. [2].) More generally, for...
متن کاملProduct Sets of Arithmetic Progressions
In this paper, we generalize a result of Nathanson and Tenenbaum on sum and product sets, partially answering the problem raised at the end of their paper [N-T]. More precisely, they proved that if A is a large finite set of integers such that |2A| < 3|A| − 4, then |A2| > ( |A| `n |A| ) 2 |A|2−ε. It is shown here that if |2A| < α|A|, for some fixed α < 4, then |A2| |A|2−ε. Furthermore, if α < 3...
متن کاملCarmichael Numbers in Arithmetic Progressions
We prove that when (a, m) = 1 and a is a quadratic residue mod m, there are infinitely many Carmichael numbers in the arithmetic progression a mod m. Indeed the number of them up to x is at least x1/5 when x is large enough (depending on m). 2010 Mathematics subject classification: primary 11N25; secondary 11A51.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1988
ISSN: 0002-9939
DOI: 10.2307/2047261